#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,a[100010];
deque<ll> q;
int main()
{
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
	    cin>>a[i];
	sort(a+1,a+n+1);
	q.push_back(a[1]);
	for(int i=2;i<=n;i++)
	{
		ll x=q.back();
		if(a[i]==x)
		    q.push_back(a[i]);
		else
		{
			q.pop_back();
			q.push_front(a[i]);
		}
	}
	cout<<q.size()<<endl;
	return 0;
}
